Competing Transport Networks
نویسندگان
چکیده
منابع مشابه
Competing Transport Networks
In a circular city model, I consider network design and pricing decisions for a single fast transport connection that faces competition from a slower but better accessible transport mode. To access the fast transport network individuals have to make complementary trips by slow mode. This fact has interesting implications on the location decisions. I show that in the presence of competition the ...
متن کاملCompeting over Networks
Recent advances in information technology have allowed firms to gather vast amounts of data regarding consumers’ preferences and the structure and intensity of their social interactions. This paper examines a game-theoretic model of competition between firms, which can target their marketing budgets to individuals embedded in a social network. We provide a sharp characterization of the optimal ...
متن کاملCompeting epidemics on complex networks
Human diseases spread over networks of contacts between individuals and a substantial body of recent research has focused on the dynamics of the spreading process. Here we examine a model of two competing diseases spreading over the same network at the same time, where infection with either disease gives an individual subsequent immunity to both. Using a combination of analytic and numerical me...
متن کاملSuccessful strategies for competing networks
Competitive interactions represent one of the driving forces behind evolution and natural selection in biological and sociological systems1,2. For example, animals in an ecosystem may vie for food or mates; in a market economy, firms may compete over the same group of customers; sensory stimuli may compete for limited neural resources to enter the focus of attention. Here, we derive rules based...
متن کاملSocial Networks with Competing Products
We introduce a new threshold model of social networks, in which the nodes influenced by their neighbours can adopt one out of several alternatives. We characterize social networks for which adoption of a product by the whole network is possible (respectively necessary) and the ones for which a unique outcome is guaranteed. These characterizations directly yield polynomial time algorithms that a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2003
ISSN: 1556-5068
DOI: 10.2139/ssrn.382284